Maximal Infinite-Valued Constraint Languages
نویسندگان
چکیده
We systematically investigate the computational complexity of constraint satisfaction problems for constraint languages over an infinite domain. In particular, we study a generalization of the well-established notion of maximal constraint languages from finite to infinite domains. If the constraint language can be defined with an ω-categorical structure, then maximal constraint languages are in one-to-one correspondence to minimal oligomorphic clones. Based on this correspondence, we derive general tractability and hardness criteria for the corresponding constraint satisfaction problems.
منابع مشابه
A General Scalar-Valued Gap Function for Nonsmooth Multiobjective Semi-Infinite Programming
For a nonsmooth multiobjective mathematical programming problem governed by infinitely many constraints, we define a new gap function that generalizes the definitions of this concept in other articles. Then, we characterize the efficient, weakly efficient, and properly efficient solutions of the problem utilizing this new gap function. Our results are based on $(Phi,rho)-$invexity,...
متن کاملComputing Science AN ALGEBRAIC THEORY OF COMPLEXITY FOR VALUED CONSTRAINTS: ESTABLISHING A GALOIS CONNECTION
The complexity of any optimisation problem depends critically on the form of the objective function. Valued constraint satisfaction problems are discrete optimisation problems where the function to be minimised is given as a sum of cost functions defined on specified subsets of variables. These cost functions are chosen from some fixed set of available cost functions, known as a valued constrai...
متن کاملAn Algebraic Theory of Complexity for Valued Constraints: Establishing a Galois Connection
The complexity of any optimisation problem depends critically on the form of the objective function. Valued constraint satisfaction problems are discrete optimisation problems where the function to be minimised is given as a sum of cost functions defined on specified subsets of variables. These cost functions are chosen from some fixed set of available cost functions, known as a valued constrai...
متن کاملThe Power of Linear Programming for General-Valued CSPs
Let D, called the domain, be a fixed finite set and let Γ, called the valued constraint language, be a fixed set of functions of the form f : D → Q ∪ {∞}, where different functions might have different arity m. We study the valued constraint satisfaction problem parametrised by Γ, denoted by VCSP(Γ). These are minimisation problems given by n variables and the objective function given by a sum ...
متن کاملTwo-Level Optimization Problems with Infinite Number of Convex Lower Level Constraints
This paper proposes a new form of optimization problem which is a two-level programming problem with infinitely many lower level constraints. Firstly, we consider some lower level constraint qualifications (CQs) for this problem. Then, under these CQs, we derive formula for estimating the subdifferential of its valued function. Finally, we present some necessary optimality condit...
متن کامل